TSTP Solution File: SEV489^1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV489^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n024.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 09:43:23 EDT 2024

% Result   : Theorem 0.12s 0.37s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   23 (   8 unt;   7 typ;   0 def)
%            Number of atoms       :   78 (  21 equ;   0 cnn)
%            Maximal formula atoms :    4 (   4 avg)
%            Number of connectives :  100 (  14   ~;   0   |;   4   &;  74   @)
%                                         (   1 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   17 (  17   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   3 con; 0-4 aty)
%            Number of variables   :   38 (   0   ^  28   !;   6   ?;  38   :)
%                                         (   4  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_6,type,
    sK0: $tType ).

thf(func_def_0,type,
    'const/sets/INSERT': 
      !>[X0: $tType] : ( X0 > ( X0 > $o ) > X0 > $o ) ).

thf(func_def_1,type,
    'const/sets/IN': 
      !>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).

thf(func_def_2,type,
    'const/sets/EMPTY': 
      !>[X0: $tType] : ( X0 > $o ) ).

thf(func_def_6,type,
    sK1: sK0 > $o ).

thf(func_def_7,type,
    sK2: sK0 ).

thf(func_def_9,type,
    ph4: 
      !>[X0: $tType] : X0 ).

thf(f21,plain,
    $false,
    inference(subsumption_resolution,[],[f20,f18]) ).

thf(f18,plain,
    ! [X0: $tType,X1: X0] :
      ( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 )
     != $true ),
    inference(cnf_transformation,[],[f14]) ).

thf(f14,plain,
    ! [X0: $tType,X1: X0] :
      ( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 )
     != $true ),
    inference(flattening,[],[f7]) ).

thf(f7,plain,
    ! [X0: $tType,X1: X0] :
      ( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 )
     != $true ),
    inference(fool_elimination,[],[f6]) ).

thf(f6,plain,
    ! [X0: $tType,X1: X0] :
      ~ ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 ),
    inference(rectify,[],[f2]) ).

thf(f2,axiom,
    ! [X0: $tType,X1: X0] :
      ~ ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 ),
    file('/export/starexec/sandbox/tmp/tmp.sJojDrfIzw/Vampire---4.8_28583','thm/sets/NOT_IN_EMPTY_') ).

thf(f20,plain,
    ( $true
    = ( 'const/sets/IN' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 ) ),
    inference(cnf_transformation,[],[f17]) ).

thf(f17,plain,
    ( ( $true
      = ( 'const/sets/IN' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 ) )
    & ( $true
     != ( sK1 @ sK2 ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f15,f16]) ).

thf(f16,plain,
    ( ? [X0: $tType,X1: X0 > $o,X2: X0] :
        ( ( $true
          = ( 'const/sets/IN' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 ) )
        & ( $true
         != ( X1 @ X2 ) ) )
   => ( ( $true
        = ( 'const/sets/IN' @ sK0 @ sK2 @ 'const/sets/EMPTY' @ sK0 ) )
      & ( $true
       != ( sK1 @ sK2 ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f15,plain,
    ? [X0: $tType,X1: X0 > $o,X2: X0] :
      ( ( $true
        = ( 'const/sets/IN' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 ) )
      & ( $true
       != ( X1 @ X2 ) ) ),
    inference(ennf_transformation,[],[f13]) ).

thf(f13,plain,
    ~ ! [X0: $tType,X1: X0 > $o,X2: X0] :
        ( ( $true
          = ( 'const/sets/IN' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 ) )
       => ( $true
          = ( X1 @ X2 ) ) ),
    inference(flattening,[],[f12]) ).

thf(f12,plain,
    ~ ! [X0: $tType,X1: X0 > $o,X2: X0] :
        ( ( $true
          = ( 'const/sets/IN' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 ) )
       => ( $true
          = ( X1 @ X2 ) ) ),
    inference(true_and_false_elimination,[],[f9]) ).

thf(f9,plain,
    ~ ! [X0: $tType,X1: X0 > $o] :
        ( $true
      <=> ! [X2: X0] :
            ( ( $true
              = ( 'const/sets/IN' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 ) )
           => ( $true
              = ( X1 @ X2 ) ) ) ),
    inference(fool_elimination,[],[f8]) ).

thf(f8,plain,
    ~ ! [X0: $tType,X1: X0 > $o] :
        ( $true
        = ( ! [X2: X0] :
              ( ( 'const/sets/IN' @ X0 @ X2 @ 'const/sets/EMPTY' @ X0 )
             => ( X1 @ X2 ) ) ) ),
    inference(rectify,[],[f4]) ).

thf(f4,negated_conjecture,
    ~ ! [X0: $tType,X4: X0 > $o] :
        ( $true
        = ( ! [X1: X0] :
              ( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 )
             => ( X4 @ X1 ) ) ) ),
    inference(negated_conjecture,[],[f3]) ).

thf(f3,conjecture,
    ! [X0: $tType,X4: X0 > $o] :
      ( $true
      = ( ! [X1: X0] :
            ( ( 'const/sets/IN' @ X0 @ X1 @ 'const/sets/EMPTY' @ X0 )
           => ( X4 @ X1 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.sJojDrfIzw/Vampire---4.8_28583','thm/sets/FORALL_IN_CLAUSES_0') ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13  % Problem    : SEV489^1 : TPTP v8.1.2. Released v7.0.0.
% 0.09/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.35  % Computer : n024.cluster.edu
% 0.12/0.35  % Model    : x86_64 x86_64
% 0.12/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35  % Memory   : 8042.1875MB
% 0.12/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit   : 300
% 0.12/0.35  % WCLimit    : 300
% 0.12/0.35  % DateTime   : Fri May  3 12:08:05 EDT 2024
% 0.12/0.35  % CPUTime    : 
% 0.12/0.35  This is a TH1_THM_EQU_NAR problem
% 0.12/0.35  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.sJojDrfIzw/Vampire---4.8_28583
% 0.12/0.37  % (28699)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.12/0.37  % (28698)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.12/0.37  % (28697)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.12/0.37  % (28695)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.12/0.37  % (28696)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.12/0.37  % (28701)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.12/0.37  % (28700)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.12/0.37  % (28702)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.12/0.37  % Exception at run slice level
% 0.12/0.37  User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.12/0.37  % (28700)First to succeed.
% 0.12/0.37  % (28698)Instruction limit reached!
% 0.12/0.37  % (28698)------------------------------
% 0.12/0.37  % (28698)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.37  % (28698)Termination reason: Unknown
% 0.12/0.37  % (28698)Termination phase: Saturation
% 0.12/0.37  
% 0.12/0.37  % (28698)Memory used [KB]: 5500
% 0.12/0.37  % (28698)Time elapsed: 0.003 s
% 0.12/0.37  % (28698)Instructions burned: 2 (million)
% 0.12/0.37  % (28698)------------------------------
% 0.12/0.37  % (28698)------------------------------
% 0.12/0.37  % (28695)Also succeeded, but the first one will report.
% 0.12/0.37  % (28702)Instruction limit reached!
% 0.12/0.37  % (28702)------------------------------
% 0.12/0.37  % (28702)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.37  % (28702)Termination reason: Unknown
% 0.12/0.37  % (28702)Termination phase: Saturation
% 0.12/0.37  
% 0.12/0.37  % (28702)Memory used [KB]: 5500
% 0.12/0.37  % (28702)Time elapsed: 0.004 s
% 0.12/0.37  % (28702)Instructions burned: 3 (million)
% 0.12/0.37  % (28702)------------------------------
% 0.12/0.37  % (28702)------------------------------
% 0.12/0.37  % (28696)Also succeeded, but the first one will report.
% 0.12/0.37  % (28700)Refutation found. Thanks to Tanya!
% 0.12/0.37  % SZS status Theorem for Vampire---4
% 0.12/0.37  % SZS output start Proof for Vampire---4
% See solution above
% 0.12/0.37  % (28700)------------------------------
% 0.12/0.37  % (28700)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.37  % (28700)Termination reason: Refutation
% 0.12/0.37  
% 0.12/0.37  % (28700)Memory used [KB]: 5500
% 0.12/0.37  % (28700)Time elapsed: 0.003 s
% 0.12/0.37  % (28700)Instructions burned: 1 (million)
% 0.12/0.37  % (28700)------------------------------
% 0.12/0.37  % (28700)------------------------------
% 0.12/0.37  % (28694)Success in time 0.014 s
% 0.12/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------